Solving a big-scaled hospital facility layout problem with meta-heuristics algorithms
نویسندگان
چکیده
منابع مشابه
A hospital facility layout problem finally solved
This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans-Beckmann variant of the Quadratic Assignment Problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German university hospital, Klinikum Regensburg. This problem, known as the Krarup30a upon its inclusion in the ...
متن کاملSimulated annealing heuristics for the dynamic facility layout problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that sum of the material handling and rearrangement costs are minimized. This probl...
متن کاملStochastic Facility Layout Planning Problem: A Metaheuristic and Case Study
Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....
متن کاملSolving Facility Layout Problem: Three-level Tabu Search Metaheuristic Approach
In this paper an improved tabu search (ITS) based approach is proposed for solving facility layout problem (FLP) which is formulated as quadratic assignment problem (QAP). ITS is an improved version of conventional tabu search technique which incorporates three levels viz. intensification, reconstruction, and solution acceptance. To evaluate the efficacy of the proposed ITS, it is tested for be...
متن کاملSolving the flight perturbation problem with meta heuristics
When there is a perturbation in a carefully constructed aircraft schedule, e.g. an aircraft breakdown, it is important to minimize the negative consequences of this disturbance. Here, a tabu search and a simulated annealing approach to the flight perturbation problem are presented. The heuristics use a tree-search algorithm to find new schedules for the aircraft, and utilize a path relinking st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Science and Technology, an International Journal
سال: 2020
ISSN: 2215-0986
DOI: 10.1016/j.jestch.2019.10.006